Planar Open Rectangle-of-Influence Drawings with Non-aligned Frames
نویسندگان
چکیده
A straight-line drawing of a graph is an open weak rectangleof-influence (RI) drawing, if there is no vertex in the relative interior of the axis-parallel rectangle induced by the end points of each edge. No algorithm is known to test whether a graph has a planar open weak RI-drawing, not even for inner triangulated graphs. In this paper, we study RI-drawings that must have a non-aligned frame, i.e., the graph obtained from removing the interior of every filled triangle is drawn such that no two vertices have the same coordinate. We give a polynomial algorithm to test whether an inner triangulated graph has a planar open weak RI-drawing with non-aligned frame.
منابع مشابه
Open Rectangle-of-Influence Drawings of Non-triangulated Planar Graphs
A straight line drawing of a graph is an open weak rectangle-of-influence (RI) drawing if there is no vertex in the relative interior of the axis parallel rectangle induced by the end points of each edge. Despite recent interest of the graph drawing community in rectangle-of-influence drawings, no algorithm is known to test whether a graph has a planar open weak RI-drawing. In a recent paper, w...
متن کاملPlanar Open Rectangle-of-Influence Drawings
A straight line drawing of a graph is an open weak rectangle-of-influence (RI) drawing, if there is no vertex in the relative interior of the axis parallel rectangle induced by the end points of each edge. Despite recent interest of the graph drawing community in rectangle-of-influence drawings, no algorithm is known to test whether a graph has a planar open weak RI-drawing, not even for inner ...
متن کاملRectangle-of-influence triangulations
The concept of rectangle-of-influence (RI) drawings is old and well-studied in the area of graph drawing. A graph has such a drawing if we can assign points to its vertices such that for every edge (v, w) the supporting rectangle (i.e., the minimal closed axis-aligned rectangle R(v, w) containing v and w) contains no other points. In the original setup, the graph had to have an edge for every p...
متن کاملAlgorithm for finding the largest inscribed rectangle in polygon
In many industrial and non-industrial applications, it is necessary to identify the largest inscribed rectangle in a certain shape. The problem is studied for convex and non-convex polygons. Another criterion is the direction of the rectangle: axis aligned or general. In this paper a heuristic algorithm is presented for finding the largest axis aligned inscribed rectangle in a general polygon. ...
متن کاملNon-aligned Drawings of Planar Graphs
A non-aligned drawing of a graph is a drawing where no two vertices are in the same row or column. Auber et al. showed that not all planar graphs have non-aligned drawings that are straight-line, planar, and in the minimal-possible n × n-grid. They also showed that such drawings exist if up to n− 3 edges may have a bend. In this paper, we give algorithms for non-aligned planar drawings that imp...
متن کامل